SUNNY-CP and the MiniZinc challenge
نویسندگان
چکیده
منابع مشابه
SUNNY-CP and the MiniZinc challenge
In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc...
متن کاملThe MiniZinc Challenge 2008-2013
set of MiniZinc models and problems instances. MiniZinc1 (Nethercote et al. 2007) was our response to the call for a standard constraint-programming modeling language. MiniZinc is high level enough to express most combinatorial optimization problems easily and in a largely solverindependent way; for example, it supports sets, arrays, and user-defined predicates, some overloading, and some autom...
متن کاملMiniZinc: Towards a Standard CP Modelling Language
There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to experiment with different solvers for a problem. In this paper we present MiniZinc, a simple but expressive CP modelling language which is suitable for modelling problems for a range of solvers and provides a reasonable compro...
متن کاملSUNNY with Algorithm Configuration
The SUNNY algorithm is a portfolio technique originally tailored for Constraint Satisfaction Problems (CSPs). SUNNY allows to select a set of solvers to be run on a given CSP, and was proven to be effective in the MiniZinc Challenge, i.e., the yearly international competition for CP solvers. In 2015, SUNNY was compared with other solver selectors in the first ICON Challenge on algorithm selecti...
متن کاملEmbedding MiniZinc?
MiniZinc is an expressive, mid-level modelling language for combinatorial optimisation problems. Its main advantage over other modelling languages and systems is the approach towards solver-independent modelling: it comes with an extensive library of global constraints that are supported by all MiniZinc-compatible solvers – either through decomposition, or as a native builtin constraint of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2017
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068417000205